BUILDING MINIMUM SPANNING TREES BY LIMITED NUMBER OF NODES OVER TRIANGULATED SET OF INITIAL NODES

Background. The common purpose of modelling and using minimum spanning trees is to ensure efficient coverage. In many tasks designing telecommunication networks, the number network nodes usually limited. terms rational allocation, there are more possible locations than factually active tools be settled those locations.
 Objective. Given an initial set planar nodes, problem build a tree connecting given which can less cardinality set. root node primarily assigned, but it changed if needed.
 Methods. To obtain edges, Delaunay triangulation performed over nodes. Distances between every pair in respective edges calculated. These distances being lengths used as graph weights, built this graph.
 Results. always has solution desired (the available recipient nodes) equal initially If lesser, maximal edge length found excluded while greater nodes.
 Conclusions. by limited suggested use iterative procedure order meet Planar triangulated, whereupon weights graph. iterations reduce done only redundant When failed, must before changed.